Approximations and reducts with covering generalized rough sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rough sets and ordinal reducts

Rough set theory has been successfully applied in selecting attributes to improve the effectiveness in deriving decision trees/rules for decisions and classification problems. When decisions involve ordinal classes, the rough set reduction process should try to preserve the order relation generated by the decision classes. Previous works on rough sets when applied to ordinal decision systems st...

متن کامل

Rough Entropy Based on Generalized Rough Sets Covering Reduction

In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...

متن کامل

Covering Numbers in Covering-Based Rough Sets

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...

متن کامل

Covering-based fuzzy rough sets

Many researchers have combined rough set theory and fuzzy set theory in order to easily approach problems of imprecision and uncertainty. Covering-based rough sets are one of the important generalizations of classical rough sets. Naturally, covering-based fuzzy rough sets can be studied as a combination of covering-based rough set theory and fuzzy set theory. It is clear that Pawlak’s rough set...

متن کامل

Rough Approximations on Preordered Sets

In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2008

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2006.12.104